Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one

Source URL: www2.informatik.hu-berlin.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Packing problems
• NP-complete problems
• Bin packing problem
• Approximation algorithms
• Polynomial-time approximation scheme
• Partition problem
• NP
• NC
• Time complexity

Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Dominating set
• Independent set
• Vertex cover
• Connected dominating set
• Set cover problem
• Line graph
• Metric k-center
• Domatic number

Property Testing: A Learning Theory Perspective Dana Ron∗ School of EE Tel-Aviv University Ramat Aviv, Israel

Source URL: www.eng.tau.ac.il

• Machine learning
• Computational complexity theory
• Theoretical computer science
• Applied mathematics
• Learning
• Models of computation
• Property testing
• Decision tree model
• Sample complexity
• PP
• Probability distribution
• Time complexity

December 15, :20 WSPC - Proceedings Trim Size: 9.75in x 6.5in

Source URL: www.jsbi.org

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Clique
• Subgraph isomorphism problem
• Matching
• Protein kinase
• Protein
• Root-mean-square deviation of atomic positions

Ant Algorithms for Discrete Optimization Marco Dorigo and Gianni Di Caro IRIDIA, Universit´e Libre de Bruxelles Brussels, Belgium

Source URL: www.strc.ch

• Computational complexity theory
• Ant colony optimization algorithms
• Mathematics
• Ant
• Systems science
• Travelling salesman problem
• Argentine ant
• Stigmergy
• Pheromone
• Dalle Molle Institute for Artificial Intelligence Research
• Artificial ants
• Swarm intelligence

Solution Quality and Efficiency in Discrete Optimization 2 Scientific Work

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Mathematics
• Theory of computation
• Operations research
• NP-complete problems
• Mathematical optimization
• Convex optimization
• Travelling salesman problem
• Approximation algorithm
• Optimization problem
• Algorithm
• Genetic algorithm

Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture

Source URL: www.usenix.org

• Complexity classes
• Circuit complexity
• Computational complexity theory
• Zero-knowledge proof
• Non-interactive zero-knowledge proof
• SM-62 Snark
• XTR
• NC
• NP
• Proof of knowledge
• Computer
• ZK

Template-based circuit understanding Adri`a Gasc´on∗ , Pramod Subramanyan† , Bruno Dutertre∗ , Ashish Tiwari∗ Dejan Jovanovi´c∗ , Sharad Malik† ∗ SRI International , ,

Source URL: yices.csl.sri.com

• Computational complexity theory
• Theoretical computer science
• Theory of computation
• Logic in computer science
• Formal methods
• Boolean algebra
• Complexity classes
• Electronic design automation
• Satisfiability modulo theories
• True quantified Boolean formula
• FO
• NC

On the Computational Complexity of ReoptimizationScientific Work

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Approximation algorithms
• NP-complete problems
• Complexity classes
• Theoretical computer science
• Travelling salesman problem
• APX
• Optimization problem
• Combinatorial optimization
• Genetic algorithm
• Heuristic
• Steiner tree problem

i Computational Complexity: A Modern Approach Draft of a book: Dated January 2007 Comments welcome!

Source URL: theory.cs.princeton.edu